THE INVERSE MAXIMUM FLOW PROBLEM UNDER WEIGHTED l∞ NORM
نویسندگان
چکیده
The problem introduced in this paper (denoted IMFW∞) is to modify the capacities on arcs from a network so that a given feasible flow becomes a maximum flow and the maximum cost of change of the capacities is minimum. This problem is a generalization of the inverse maximum flow problem under l∞ norm (denoted IMF∞, where the per unit cost of modification is equal to 1 on all arcs), which was priviously studied and solved in polynomial time. In this paper, the algorithm for IMF∞ is adapted to solve IMFW∞. 2000 Mathematics Subject Classification: 90C27, 90C35, 68R10.
منابع مشابه
Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملTHE INVERSE MAXIMUM FLOW PROBLEM UNDER WEIGHTED lk NORM
The problem consists in modifying the lower and the upper bounds of a given feasible flow f in a network G so that the given flow becomes a maximum flow in G and the distance between the initial vector of bounds and the modified one measured using weighted Lk norm (k ∈ N) is minimum. We denote this problem by IMFWLk. IMFWLk is a generalization of the inverse maximum flow problem under Lk norm (...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملSome inverse min-max network problems under weighted l1 and linfinity norms with bound constraints on changes
We consider some inverse min-max (or max-min) network problems. Such an inverse problem is to modify the weights with bound constraints so that a given feasible solution becomes an optimal solution of a min-max (or max-min) network problem, and the deviation of the weights, measured by the weighted l1 norm or weighted l∞ norm, is minimum. In this paper, we present strongly polynomial time algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009